Aggregate Matchings ∗ Federico Echenique
نویسندگان
چکیده
This paper characterizes the testable implications of stability for aggregate matchings. We consider data on matchings where individuals are aggregated, based on their observable characteristics, into types, and we know how many agents of each type match. We derive stability conditions for an aggregate matching, and, based on these, provide a simple necessary and sufficient condition for an observed aggregate matching to be rationalizable (i.e. such that preferences can be found so that the observed aggregate matching is stable). Subsequently, we derive moment inequalities based on the stability conditions, and provide an empirical illustration using the cross-sectional marriage distributions across the US states. Echenique thanks the Lee Center at Caltech, and the NSF, for funding related to this project. Division of the Humanities and Social Sciences, California Institute of Technology, Pasadena CA 91125. Emails: {fede,sangmok,mshum}@hss.caltech.edu.
منابع مشابه
Finding All Stable Matchings with Couples
In two-sided matching markets in which some doctors form couples, we present an algorithm that finds all the stable matchings whenever one exists, and otherwise shows that there is no stable matching. Extending the methodology of Echenique and Yenmez (2006), we characterize the set of stable matchings as the fixed points of a monotone decreasing function with respect to a certain partial order....
متن کاملWhat Matchings Can Be Stable? The Testable Implications of Matching Theory
This paper studies the falsifiability of two-sided matching theory when agents’ preferences are unknown. A collection of matchings is rationalizable if there are preferences for the agents involved so that the matchings are stable. We show that there are nonrationalizable collections of matchings; hence, the theory is falsifiable. We also characterize the rationalizable collections of matchings...
متن کاملPartial Identification in Two-sided Matching Models
In this paper we propose a methodology for estimating preference parameters in matching models. Our estimator applies to repeated observations of matchings among a fixed group of individuals, which is a similar data structure as in Fox (2010). Our estimator is based on stability conditions in the matching models; we consider both transferable (TU) and non-transferable utility (NTU) models. In b...
متن کامل– FORTHCOMING in Advances in Econometrics (vol 31) – PARTIAL IDENTIFICATION IN TWO-SIDED MATCHING MODELS
In this paper we propose a methodology for estimating preference parameters in matching models. Our estimator applies to repeated observations of matchings among a fixed group of individuals, which is a similar data structure as in Fox (2010). Our estimator is based on stability conditions in the matching models; we consider both transferable (TU) and non-transferable utility (NTU) models. In b...
متن کاملCore many-to-one matchings by fixed-point methods
We characterize the core many-to-one matchings as fixed points of a map. Our characterization gives an algorithm for finding core allocations; the algorithm is efficient and simple to implement. Our characterization does not require substitutable preferences, so it is separate from the structure needed for the non-emptiness of the core. When preferences are substitutable, our characterization g...
متن کامل